Virtual Path Layouts with Low Congestion or Low Diameter in ATM Networks
نویسندگان
چکیده
Motivated by Asynchronous Transfer Mode (ATM) in telecommunication networks, we investigate the problem of designing a directed virtual topology on a directed physical topology, which consists in nding a set of directed virtual paths (VPs) satisfying some constraints in terms of load (the number of VPs sharing a physical link) and hop count (the number of VPs used to establish a connection). For both general and particular networks, such as paths, cycles, meshes, tori and trees, we derive tight bounds on the virtual diameter (the maximum hop count for a connection) as a function of the network capacity (the maximum load of a physical link). The dual issue is also addressed.
منابع مشابه
Virtual Path Layouts in ATM Networks
We study virtual path layouts in a very popular type of fast interconnection networks, namely ATM networks. One of the main problems in such networks is to construct path layout that minimizes the hop-number (i.e. the number of virtual paths between any two nodes) as a function of edge congestion (i.e. the number of virtual paths going through a link). In this paper we construct for any n verte...
متن کاملMinimizing Congestion of Layouts for ATMNetworks
We consider the problem of constructing virtual path layouts for an ATM network consisting of a complete network K n of n processors in which a certain number of links may fail. Our main goal is to construct layouts which tolerate any connguration of up to f layouts and have the least possible congestion. First, we study the minimal congestion of 1-hop f-tolerant layouts in K n. For any positiv...
متن کاملDimensioning ATM Networks using 2-Layer Hierarchical Virtual Path Layouts
This paper addresses the problem of dimensioning multi-service ATM networks, where each service is supported by a different logical network. In the traditional approach, logical networks are configured with end-to-end VPCs, which greatly simplifies VCC admission control. This approach does not explore resource sharing gains since an end-to-end VPC bandwidth is assigned to each VCC flow. In this...
متن کاملVirtual network embedding in the cycle
We consider a problem motivated by the design of ATM (Asynchronous Transfer Mode) networks. Given a physical network and an All-to-All traffic, the problem consists in designing a virtual network with a given diameter, which can be embedded in the physical one with a minimum congestion (the congestion is the maximum load of a physical link). Here we solve the problem when the physical network i...
متن کاملVirtual path layouts optimizing total hop count on ATM tree networks
This paper presents some algorithmic results concerning virtual path layouts for the one-to-many communication problem in ATM tree networks. The ATM network model is based on covering the network with a layout of virtual paths, under some constraints on the allowed load, namely, the number of paths that can share an edge. The quality measure used is the hop count, namely, the number of edges tr...
متن کامل